Recovering Sparse Low-rank Blocks in Mass Spectrometry∗

نویسندگان

  • GRAEME POPE
  • RICHARD G. BARANIUK
چکیده

We develop a novel sparse low-rank block (SLoB) signal recovery framework that simultaneously exploits sparsity and low-rankness to accurately identify peptides (fragments of proteins) from biological samples via tandem mass spectrometry (TMS). To efficiently perform SLoB-based peptide identification, we propose two novel recovery algorithms, an exact iterative method and an approximate greedy algorithm, and provide analytical recovery guarantees. Using experiments with synthetic and real-world TMS data, we demonstrate that the proposed framework and algorithms are capable of substantially outperforming existing sparse signal recovery techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recovering Sparse Low-rank Blocks in Tandem Mass Spectrometry

We develop a novel sparse low-rank block (SLoB) signal recovery framework that simultaneously exploits sparsity and low-rankness to accurately identify peptides (fragments of proteins) from biological samples observed using tandem mass spectrometery (TMS). To efficiently perform SLoB-based peptide identification, we propose two novel recovery algorithms: An exact iterative method based on the a...

متن کامل

Sparse Signal Recovery from Fixed Low-Rank Subspace via Compressive Measurement

This paper designs and evaluates a variant of CoSaMP algorithm, for recovering the sparse signal s from the compressive measurement ( ) v Uw s   given a fixed lowrank subspace spanned by U. Instead of firstly recovering the full vector then separating the sparse part from the structured dense part, the proposed algorithm directly works on the compressive measurement to do the separation. We i...

متن کامل

Sparse and Low-rank Matrix Decomposition via Alternating Direction Methods

The problem of recovering the sparse and low-rank components of a matrix captures a broad spectrum of applications. Authors in [4] proposed the concept of ”rank-sparsity incoherence” to characterize the fundamental identifiability of the recovery, and derived practical sufficient conditions to ensure the high possibility of recovery. This exact recovery is achieved via solving a convex relaxati...

متن کامل

Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery

Recovering a low-rank tensor from incomplete information is a recurring problem in signal processing and machine learning. The most popular convex relaxation of this problem minimizes the sum of the nuclear norms of the unfoldings of the tensor. We show that this approach can be substantially suboptimal: reliably recovering a K-way tensor of length n and Tucker rank r from Gaussian measurements...

متن کامل

Efficient Compressive Phase Retrieval with Constrained Sensing Vectors

We propose a new approach to the problem of compressive phase retrieval in which the goal is to reconstruct a sparse vector from the magnitude of a number of its linear measurements. The proposed framework relies on constrained sensing vectors and a two-stage reconstruction method that consists of two standard convex optimization programs that are solved sequentially. Various methods for compre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013